Gröbner Basis Techniques for Computing Actions of K - Categories ∗
نویسنده
چکیده
This paper involves categories and computer science. Gröbner basis theory is a branch of computer algebra which has been usefully applied to a wide range of problems. Kan extensions are a key concept of category theory capable of expressing most algebraic structures. The paper combines the two, using Gröbner basis techniques to compute certain kinds of Kan extension.
منابع مشابه
One-sided Noncommutative Gröbner Bases with Applications to Computing Green's Relations *
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of ...
متن کاملar X iv : m at h . R A / 9 90 30 33 v 1 5 M ar 1 99 9 One - sided
Standard noncommutative Gröbner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gröbner basis procedures for one-sided ideals in finitely presented noncommutative algebras over fields. The polynomials defining a K-algebra A as a quotient of a free K-algebra are combined with the polynomials defining a one-sided ideal I of ...
متن کاملModular Techniques For Noncommutative Gröbner Bases
In this note, we extend modular techniques for computing Gröbner bases from the commutative setting to the vast class of noncommutative G-algebras. As in the commutative case, an effective verification test is only known to us in the graded case. In the general case, our algorithm is probabilistic in the sense that the resulting Gröbner basis can only be expected to generate the given ideal, wi...
متن کاملOn Constructing Resolutions over the Polynomial Algebra
Let k be a field, and A be a polynomial algebra over k. Let I ⊆ A be an ideal. We present a novel method for computing resolutions of A/I over A. The method is a synthesis of Gröbner basis techniques and homological perturbation theory. The examples in this paper were computed using computer algebra. To Jan–Erik Roos on his sixty–fifth birthday Appears in Homology, Homotopy and Applications, vo...
متن کاملA Variant of the Gröbner Basis Algorithm for Computing Hilbert Bases
Gröbner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel. AMS Subject Classification: 13P10, 94B05
متن کامل